On the Trivial Many Sorted Algebras and Many Sorted Congruences
نویسنده
چکیده
In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be a set and let M be a many sorted set indexed by I. One can check that there exists an element of Bool(M) which is locally-finite. Let I be a set and let M be a non-empty many sorted set indexed by I. Note that there exists a many sorted subset indexed by M which is non-empty and locally-finite. Let S be a non empty non void many sorted signature, let A be a non-empty algebra over S, and let o be an operation symbol of S. Note that every element of Args(o,A) is finite sequence-like. Let S be a non void non empty many sorted signature, let I be a set, let s be a sort symbol of S, and let F be an algebra family of I over S. Observe that every element of (SORTS(F))(s) is function-like and relation-like. Let S be a non void non empty many sorted signature and let X be a non-empty many sorted set indexed by the carrier of S. One can verify that FreeGenerator(X) is free and non-empty. Let S be a non void non empty many sorted signature and let X be a non-empty many sorted set indexed by the carrier of S. Observe that Free(X) is free. Let S be a non empty non void many sorted signature and let A, B be non-empty algebras over S. Note that [:A, B :] is non-empty. The following propositions are true:
منابع مشابه
On the Completeness Theorem of Many-sorted Equational Logic and the Equivalence between Hall Algebras and Bénabou Theories
The completeness theorem of equational logic of Birkhoff asserts the coincidence of the model-theoretic and proof-theoretic consequence relations. Goguen and Meseguer, giving a sound and adequate system of inference rules for many-sorted deduction, founded ultimately on the congruences on Hall algebras, generalized the completeness theorem of Birkhoff to the completeness theorem of many-sorted ...
متن کاملPriestley Duality for Many Sorted Algebras and Applications
In this work we develop a categorical duality for certain classes of manysorted algebras, called many-sorted lattices because each sort admits a structure of distributive lattice. This duality is strongly based on the Priestley duality for distributive lattices developed in [3] and [4] and on the representation of many sorted lattices with operators given by Sofronie-Stokkermans in [6]. In this...
متن کاملMore on Products of Many Sorted Algebras
This article is continuation of an article defining products of many sorted algebras [11]. Some properties of notions such as commute, Frege, Args() are shown in this article. Notions of constant of operations in many sorted algebras and projection of products of family of many sorted algebras are defined. There is also introduced the notion of class of family of many sorted algebras. The main ...
متن کاملA Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language specifications in K (an order-sorted algebra framework). The biggest problem in a lot of the order-sorted algebra frameworks is that even if they might allow develop...
متن کاملMany Sorted Algebras
The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between (1 sorted) universal algebras [8] and many sorted algebras with one sort only is described by introducing ...
متن کامل